A New Family of Practical Non-Malleable Diffie-Hellman Protocols

نویسندگان

  • Andrew Chi-Chih Yao
  • Yunlei Zhao
چکیده

Cryptography algorithm standards play a key role both to the practice of information securityand to cryptography theory research. Among them, the MQV and HMQV protocols ((H)MQV, inshort) are a family of (implicitly authenticated) Diffie-Hellman key-exchange (DHKE) protocols thatare widely standardized and deployed. In this work, from some new perspectives and approaches andunder some new design rationales and insights, we develop a new family of practical implicitly authen-ticated DHKE protocols, which enjoy notable performance among security, privacy, efficiency andeasy deployment. We make detailed comparisons between our new DHKE protocols and (H)MQV,showing that the newly developed protocols outperform HMQV in most aspects. Along the way,guided by our new design rationales, we also identify a new vulnerability of (H)MQV, which bringssome new perspectives (e.g., session-key computational fairness) to the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffie-Hellman type key exchange protocols based on isogenies

‎In this paper‎, ‎we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves‎. ‎The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $‎, ‎is a straightforward generalization of elliptic curve Diffie-Hellman key exchange‎. ‎The method uses commutativity of the endomorphism ring $ End(E) $‎. ‎Then using dual isogenies‎, ‎we propose...

متن کامل

Efficient and Non-Malleable Proofs of Plaintext

We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols: – Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext...

متن کامل

A New Family of Practical Non-Malleable Protocols

Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent non-malleable proof-of-knowledge and universal composability are among the most powerful and fundamental security properties. But, when achieving more and more complex cryptosystems secure in an open network like the Internet, it is often the case that generic solu...

متن کامل

Knapsack Diffie-Hellman: A New Family of Diffie-Hellman

Diffie-Hellman problems have been widely involved in the design of various cryptographic protocols. Its general family is based on the discrete logarithm over a finite field. Since 2000, its another family which is based on elliptic curve discrete logarithm as well as bilinear pairing, e.g. Weil or Tate pairing, has been attracted significant studies. Thereafter, various cryptographic protocols...

متن کامل

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications

We describe very efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El-Gamal encryption schemes whose security can be proven in the standard model. We also highlight some important applications of these protocols, where we take care to ensure that our protocols remain secure when run in an asynchronous, concurrent environment: • C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1105.1071  شماره 

صفحات  -

تاریخ انتشار 2011